A Parallel Authenticated Encryption Sharing Scheme Based on Cellular Automata

Abstract— Multi-secret sharing scheme based on cellular automata have proven to be a secure encrypting algorithm, although it cannot guarantee data integrity and authenticity of shares of the participants, allowing a chosen cipher text attack. In this work, to improve the security of multiple secret sharing scheme (SSS) against adaptive chosen cipher text attack, we introduce an authenticated encryption (Encrypt-then-MAC) based on Keccak function to a cellular automata based SSS. Taking the advantage that each cell of the cellular automata can be processed independently, we parallelize the processes of the SSS through CUDA technology, obtaining considerable reduction of the temporal complexity. The processing time of the proposed scheme is evaluated comparing with its sequential version and the speed-up rate of the parallel algorithm respect to the sequential one is 34 times in the best case.